Simple and local independent set approximation
نویسندگان
چکیده
منابع مشابه
Simple and Local Independent Set Approximation
We bound the performance guarantees that follow from Turán-like bounds for unweighted and weighted independent sets in bounded-degree graphs. In particular, a randomized approach of Boppana forms a simple 1-round distributed algorithm, as well as a streaming and preemptive online algorithm. We show it gives a tight (∆ + 1)/2-approximation in unweighted graphs of maximum degree ∆, which is best ...
متن کاملIndependent Set Size Approximation in Graph Streams
We study the problem of estimating the size of independent sets in a graph G defined by a stream of edges. Our approach relies on the Caro-Wei bound, which expresses the desired quantity in terms of a sum over nodes of the reciprocal of their degrees, denoted by β(G). Our results show that β(G) can be approximated accurately, based on a provided lower bound on β. Stronger results are possible w...
متن کاملCoordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs
We study the algorithmic problem of coordinating transmissions in a wireless network where radio interference constrains concurrent transmissions on wireless links. We focus on pairwise conflicts between the links; these can be described as a conflict graph. Associated with the conflict graph are two fundamental network coordination tasks: (a) finding a nonconflicting set of links with the maxi...
متن کاملApproximation and Parameterized Algorithms for Geometric Independent Set with Shrinking
Consider the Maximum Weight Independent Set problem for rectangles: given a family of weighted axis-parallel rectangles in the plane, find a maximum-weight subset of non-overlapping rectangles. The problem is notoriously hard both in the approximation and in the parameterized setting. The best known polynomial-time approximation algorithms achieve super-constant approximation ratios [6, 9], eve...
متن کاملApproximation Schemes for Independent Set and Sparse Subsets of Polygons
We present an (1+ε)-approximation algorithm with quasi-polynomial running time for computing the maximum weight independent set of polygons out of a given set of polygons in the plane (specifically, the running time is nO(poly(logn,1/ε))). Contrasting this, the best known polynomial time algorithm for the problem has an approximation ratio of nε. Surprisingly, we can extend the algorithm to the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2020.09.018